Robust Online Matching with User Arrival Distribution Drift
نویسندگان
چکیده
منابع مشابه
A Robust Controller with Online Authority Transformation for Dual User Haptic Training System
In this study, a force reflection control structure is developed for the surgery training haptic system. In the surgery training haptic system, the surgical operation is cooperatively performed by a trainer and a trainee. The participation of each surgeon in the operation is established through their own haptic consoles. Although the operation is primarily performed by the trainee, the trainer ...
متن کاملMaximum Matching in the Online Batch-Arrival Model
Consider a two-stage matching problem, where edges of an input graph are revealed in two stages (batches) and in each stage we have to immediately and irrevocably extend our matching using the edges from that stage. The natural greedy algorithm is half competitive. Even though there is a huge literature on online matching in adversarial vertex arrival model, no positive results were previously ...
متن کاملrobust stabilization for fuzzy network control systems with data drift
in this study, a robust controller is designed for fuzzy network control systems (ncss) using the static output feedback. delay and data packet dropout affect on the stability of network control systems, and therefore, the asymptotic stability condition is established considering delay and data packet dropout. delay is time-varying while the lower and upper bounds for delay is defined, and the ...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Online Maximum Matching with Recourse
We study the online maximum matching problem with recourse in a model in which the edges are associated with a known recourse parameter k. An online algorithm for this problem has to maintain a valid matching while edges of the underlying graph are presented one after the other. At any moment the algorithm can decide to include an edge into the matching or to exclude it, under the restriction t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.3301459